Distributed match-making

The match - making

This paper discusses a cryptographic protocol to evaluate an and-gate such that a party can keep his input bit secret from the other party. Such a protocol is of interest, because it can be generalized to any logical circuit for any number of participants. A formal statement of this generalization reads as follows: n participants want to compute together a function f(x1; x2; :::; xn) with xi be...

Residency Selection: Making a Match

Match-Making in Bartering Scenarios

This thesis extends tree similarity based match-making from the buyer/seller situation to a scenario of bilateral bartering and multi-agent ring bartering. It is built on top of the AgentMatcher tree similarity algorithm for node-labelled, arc-labelled, arc-weighted trees. A representation of these trees in a multi-dimensional space is developed to allow efficient indexing and pruning in large ...

Match-making for posaconazole through systems thinking.

Currently available drugs for Chagas' disease are limited by toxicity and low efficacy in the chronic stage. Posaconazole, the most advanced new anti-chagasic drug candidate, did not fully confirm its initial potential in a Phase II clinical trial for chronic Chagas' disease. Given that posaconazole is highly active against Trypanosoma cruzi in vitro, and was very well tolerated in clinical tri...

Fault-Tolerant Distributed Match-Making with Weights - Parallel and Distributed Systems, 1996. Proceedings., 1996 International Conference on

Protocols to solve several distributed issues, such as name service, mutual exclusion, and creation of an atomic shared register, require two types of subsets with intersection property. Distributed matchmaking provides a method of creating the subsets, and the lower bound of the number of messages t o solve the issues. This paper discusses the fault-tolerant and weighted case, in which a proto...